Asymptotic distributions for Random Median Quicksort

نویسندگان

  • H. M. Okasha
  • U. Rösler
چکیده

The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare. We analyse here the variant Random Median Quicksort. The analysis includes the expectation, the asymptotic distribution, the moments and exponential moments. The asymptotic distribution is characterized by a stochastic fixed point equation. The basic technic will be generating functions and the contraction method. © 2006 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic Distribution for Random Median Quicksort

The first complete running time analysis of a stochastic divide and conquer algorithm was given for Quicksort, a sorting algorithm invented 1961 by Hoare. We analyse here the variant Random Median Quicksort. The analysis includes the expectation, the asymptotic distribution, the moments and exponential moments. The asymptotic distribution is characterized by a stochastic fixed point equation. T...

متن کامل

On a multivariate contraction method for random recursive structures with applications to Quicksort

The contraction method for recursive algorithms is extended to the multivariate analysis of vectors of parameters of recursive structures and algorithms. We prove a general multivariate limit law which also leads to an approach to asymptotic covariances and correlations of the parameters. As an application the asymptotic correlations and a bivariate limit law for the number of key comparisons a...

متن کامل

Asymptotic expansions for factorial moments of some distributions in the analysis of algorithms

We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort algorithm. To achieve this we use singularity analysis of certain type of generating functions due to Flajolet and Odlyzko.

متن کامل

Phase changes in random m-ary search trees and generalized quicksort

We propose a uniform approach to describing the phase change of the limiting distribution of space measures in random m-ary search trees: the space requirement, when properly normalized, is asymptotically normally distributed for m ≤ 26 and does not have a fixed limit distribution for m > 26. The tools are based on the method of moments and asymptotic solutions of differential equations, and ar...

متن کامل

A numerical analysis of Quicksort: How many cases are bad cases?

We present numerical results for the probability of bad cases for Quicksort, i. e. cases of input data for which the sorting cost considerably exceeds that of the average. Dynamic programming was used to compute solutions of the recurrence for the frequency distributions of comparisons. From these solutions, probabilities of numbers of comparisons above certain thresholds relative to the averag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Discrete Algorithms

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2007